A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue
نویسندگان
چکیده
منابع مشابه
A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue
We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digital telecommunication systems and other related areas. For this queueing system, we present, based on Markov chain analysis, not only the steady-state distributions but also the tran...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملANALYSIS OF A DISCRETE-TIME IMPATIENT CUSTOMER QUEUE WITH BERNOULLI-SCHEDULE VACATION INTERRUPTION
This paper investigates a discrete-time impatient customer queue with Bernoulli-schedule vacation interruption. The vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. Cost analysi...
متن کاملMoment Calculating Algorithm for Busy-period of Discrete-time Finite-capacity M/G/1 Type Queue
In this paper, we propose an algorithm to calculate the higher moments of the busy period length of a discretetime M/G/1 type queue with finite buffer. The queueing model has a level-dependent transition probability matrix. Our algorithm is given as a set of recursive formulas which are derived from the relationship among the generating function matrices of the fundamental period. As an example...
متن کاملCost Analysis of a Discrete-time Queue
Abstract—This paper considers a Geo/G/1 queue, in which the server operates a single vacation at end of each consecutive service period. After all the customers in the system are served exhaustively, the server immediately leaves for a vacation. Upon returning from the vacation, the server inspects the queue length. If there are customers waiting in the queue, the server either resumes servin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2012
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2012.312a297